Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
991	3 Complexity of Reasoning Francesco M. Donini Add to Reading List Source URL: www.inf.unibz.it Language: English - Date: 2011-09-08 09:53:48 Complexity classes Finite model theory Boolean algebra Predicate logic Boolean satisfiability problem True quantified Boolean formula NP-complete Description logic FO Theoretical computer science Computational complexity theory Applied mathematics
992	Every 2-CSP allows nontrivial approximation Johan H˚ astad Royal Institute of Technology Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2005-06-22 08:43:27 Constraint programming Computational complexity theory Constraint satisfaction problem 2-satisfiability Constraint satisfaction Approximation algorithm Logic in computer science Combinatorial optimization Linear programming Theoretical computer science Applied mathematics Mathematics
993	INFORMATION TECHNOLOGY THE LIMITSOF Add to Reading List Source URL: www.ime.usp.br Language: English - Date: 2013-04-30 09:54:41 Complexity classes Quantum information science Mathematical optimization Quantum algorithm Quantum computer P versus NP problem NP-complete NP BQP Theoretical computer science Applied mathematics Computational complexity theory
994	543 M6660 雙曲線型守恆律 In this course, we consider the theoretical and computational aspects of hyperbolic conservation laws which originate from the conservation laws of mass, momentum and energy of various fie Add to Reading List Source URL: www.iam.ntu.edu.tw Language: English - Date: 2005-03-01 03:12:50 Dynamics Shock capturing methods Riemann solver Finite volume method Randall J. LeVeque Euler equations Hyperbolic partial differential equation High-resolution scheme Riemann problem Computational fluid dynamics Fluid dynamics Fluid mechanics
995	The Limits of Quantum Computers (DRAFT) Scott Aaronson For the published version—which differs significantly from this one—please see the March 2008 issue of Scientific American. “Haggar Physicists Develop ‘Quant Add to Reading List Source URL: www.ime.usp.br Language: English - Date: 2013-04-30 09:54:41 Complexity classes Mathematical optimization Quantum complexity theory NP-complete P versus NP problem Quantum computer Quantum algorithm NP PP Theoretical computer science Applied mathematics Computational complexity theory
996	On the Approximation Resistance of a Random Predicate Johan H˚ astad August 20, 2007 Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:58:20 Approximation algorithm Constraint programming Computational complexity theory Constraint satisfaction problem
997	Max-CSP Semi-Definite programming Inapproximability results Classification On the efficient approximability of constraint Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:55:53 Complexity classes Mathematical optimization Constraint satisfaction problem Approximation algorithm NP-complete P versus NP problem Bounded-error probabilistic polynomial Constraint satisfaction NP Theoretical computer science Computational complexity theory Applied mathematics
998	The Art of Computational Science The Maya Open Lab Add to Reading List Source URL: www.artcompsci.org Language: English - Date: 2007-09-13 19:37:50 Vectors Celestial mechanics N-body problem Center of mass Euler Algebra Mathematics Classical mechanics
999	The Art of Computational Science The Kali Code vol. 4 Add to Reading List Source URL: www.artcompsci.org Language: English - Date: 2007-09-13 13:12:54 N-body problem Format Computing Computer programming Science Celestial mechanics Softening Printf format string
1000	Theoretical Justification of Popular Link Prediction Heuristics Purnamrita Sarkar Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-03-01 02:05:39 Network theory Shortest path problem Randomized algorithm Connectivity Graph theory Networks Theoretical computer science Mathematics Computational complexity theory